On parameterized inexact Uzawa methods for generalized saddle point problems
نویسندگان
چکیده
منابع مشابه
A Modified Preconditioner for Parameterized Inexact Uzawa Method for Indefinite Saddle Point Problems
The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical analyses to show that the iteration method converges under certain conditions. Moreover, we discuss the optimal parameter and matrices based on these conditions. Finally, we propose ...
متن کاملA modified inexact Uzawa A lgorithm for generalized saddle point problems
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171]. Keywords—Saddle point problem; Inexact Uzawa algorithm; Convergence behavior.
متن کاملGlobal and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondiierentiable Mappings
This paper investigates inexact Uzawa methods for nonlinear saddle point problems. We prove that the inexact Uzawa method converges globally and superlinearly even if the derivative of the nonlinear mapping does not exist. We show that the Newton-type decomposition method for saddle point problems is a special case of a Newton-Uzawa method. We discuss applications of inexact Uzawa methods to se...
متن کاملProbing Methods for Generalized Saddle-Point Problems
Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...
متن کاملOptimization of the parameterized Uzawa preconditioners for saddle point matrices
The parameterized Uzawa preconditioners for saddle point problems are studied in this paper. The eigenvalues of the preconditioned matrix are located in (0, 2) by choosing the suitable parameters. Furthermore, we give two strategies to optimize the rate of convergence by finding the suitable values of parameters. Numerical computations show that the parameterized Uzawa preconditioners can lead ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.01.018